Efficient Bayesian multi-source localization using a graphics processing unit
نویسندگان
چکیده
This paper presents a highly-efficient approach to matched-field localization of an unknown number of ocean acoustic sources employing a graphics processing unit (GPU) for massively parallel computations. A Bayesian formulation is developed in which the number, locations, and complex spectra (amplitudes and phases) of multiple sources, as well as noise variance at each frequency, are considered unknown random variables constrained by acoustic data and prior information. The number of sources is determined during an initial burn-in stage by minimizing the Bayesian information criterion using an efficient birth/death scheme. Marginal posterior probability distributions for source locations are then computed using Gibbs sampling. Source and noise spectra are sampled implicitly by applying analytic maximum-likelihood solutions in terms of the source locations (explicit parameters). This greatly reduces the dimensionality of the inversion, but requires solving a very large number (order 105) of complex matrix inversions for each sample of the explicit parameters. These inversions can be solved in parallel on a GPU, increasing efficiency by a factor of ~100. Examples are given of localizing a large number of sources (up to 10) in near real time.
منابع مشابه
Ultra-Fast Image Reconstruction of Tomosynthesis Mammography Using GPU
Digital Breast Tomosynthesis (DBT) is a technology that creates three dimensional (3D) images of breast tissue. Tomosynthesis mammography detects lesions that are not detectable with other imaging systems. If image reconstruction time is in the order of seconds, we can use Tomosynthesis systems to perform Tomosynthesis-guided Interventional procedures. This research has been designed to study u...
متن کاملParallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملImprovement and parallelization of Snort network intrusion detection mechanism using graphics processing unit
Nowadays, Network Intrusion Detection Systems (NIDS) are widely used to provide full security on computer networks. IDS are categorized into two primary types, including signature-based systems and anomaly-based systems. The former is more commonly used than the latter due to its lower error rate. The core of a signature-based IDS is the pattern matching. This process is inherently a computatio...
متن کاملApproximate probabilistic analysis of biopathway dynamics
MOTIVATION Biopathways are often modeled as systems of ordinary differential equations (ODEs). Such systems will usually have many unknown parameters and hence will be difficult to calibrate. Since the data available for calibration will have limited precision, an approximate representation of the ODEs dynamics should suffice. One must, however, be able to efficiently construct such approximati...
متن کاملA Portable Multi-CPU/Multi-GPU Based Vertebra Localization in Sagittal MR Images
Accurate Vertebra localization presents an essential step for automating the diagnosis of many spinal disorders. In case of MR images of lumbar spine, this task becomes more challenging due to vertebra complex shape and high variation of soft tissue. In this paper, we propose an efficient framework for spine curve extraction and vertebra localization in T1-weighted MR images. Our method is a fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013